#pragma once
#include"Hash.h"

template<class K, class Hash = HashFunc<K>>
class unordered_Set
{
	struct SetofK
	{
		const K& operator()(const K& key)
		{
			return key;
		}
	};
public:
	typedef typename hash_bucket::HashTable<K,const K, SetofK, Hash>::iterator iterator;
	typedef typename hash_bucket::HashTable<K,const K, SetofK, Hash>::const_iterator const_iterator;


	iterator begin()
	{
		return _ht.begin();
	}

	iterator end()
	{
		return _ht.end();
	}

	const_iterator begin() const
	{
		return _ht.begin();
	}

	const_iterator end() const
	{
		return _ht.end();
	}

	pair<iterator, bool> insert(const K& data)
	{
		return _ht.insert(data);
	}

	iterator Find(const K& key)
	{
		return _ht.find(key);
	}

	bool Erase(const K& key)
	{
		return _ht.erase(key);
	}
private:
	hash_bucket::HashTable<K, const K, SetofK, Hash> _ht;

};